Planar graphs without adjacent cycles of length at most seven are 3-colorable
نویسندگان
چکیده
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 ≤ i ≤ j ≤ 7 is 3-colorable and pose some related problems on the 3-colorability of planar graphs.
منابع مشابه
The 3-colorability of planar graphs without cycles of length 4, 6 and 9
In this paper, we prove that planar graphs without cycles of length 4, 6, 9 are 3-colorable.
متن کاملEvery toroidal graph without triangles adjacent to $5$-cycles is DP-$4$-colorable
DP-coloring, also known as correspondence coloring, is introduced by Dvořák and Postle. It is a generalization of list coloring. In this paper, we show that every connected toroidal graph without triangles adjacent to 5-cycles has minimum degree at most three unless it is a 2-connected 4-regular graph with Euler characteristic (G) = 0. Consequently, every toroidal graph without triangles adjace...
متن کاملPlanar graphs without cycles of length from 4 to 7 are 3-colorable
Planar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, it is proved that each proper 3-coloring of a face of length from 8 to 11 in a connected plane graph without cycles of length from 4 to 7 can be extended to a proper 3-coloring of the whole graph. This improves on the previous results on a long standing conjecture of Steinberg. © 2004 Elsevier Inc. All ri...
متن کاملPlanar Graphs That Have No Short Cycles with a Chord Are 3-choosable
In this paper we prove that every planar graph G is 3-choosable if it contains no cycle of length at most 10 with a chord. This generalizes a result obtained by Borodin [J. Graph Theory 21(1996) 183-186] and Sanders and Zhao [Graphs Combin. 11(1995) 91-94], which says that every planar graph G without k-cycles for all 4 ≤ k ≤ 9 is 3-colorable.
متن کاملA sufficient condition for planar graphs to be 3-colorable
Planar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be 3-colorable. We conjecture that, moreover, each plane graph with neither 5-cycles nor intersecting 3-cycles is 3-colorable. In this conjecture, none of the two assumptions can be dropped because there exist planar 4-chromatic graphs without 5-cycles, as well as planar 4chromatic graphs without intersect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010